Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
261	String Indexing for Patterns with Wildcards Philip Bille1 , Inge Li Gørtz1 , Hjalte Wedel Vildhøj1 , and Søren Vind Technical University of Denmark, DTU Informatics, {phbi,ilg,hwvi}@imm.dtu.dk Abstract. We consider th Add to Reading List Source URL: www2.imm.dtu.dk Language: English - Date: 2012-10-17 04:44:48 Binary trees Complexity classes Path decomposition Top tree Rope Suffix tree String searching algorithm Approximate string matching Tree decomposition Graph theory Theoretical computer science Mathematics
262	Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges Robert Bredereck1 , Jiehua Chen1 , Piotr Faliszewski2 , Jiong Guo3 , Rolf Niedermeier1 , and Gerhard J. Woeginger4 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-12-01 07:16:49 Analysis of algorithms NP-complete problems Complexity classes Parameterized complexity Kernelization Vertex cover Time complexity Combinatorial optimization Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics
263	Parameterized Regular Expressions and Their Languages Pablo Barceló1 , Leonid Libkin2 , and Juan L. Reutter2 1 2 Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2011-09-27 14:42:30 Applied mathematics Automata theory EXPSPACE Regular language Regular expression Model theory PSPACE-complete FO Symbol Theoretical computer science Formal languages Complexity classes
264	Willson Algorithms for Molecular Biology 2012, 7:13 http://www.almob.org/contentRESEARCH Open Access Add to Reading List Source URL: www.almob.org Language: English Complexity classes NP-complete problems Mathematical optimization NP P versus NP problem Graph Tree Directed graph Theoretical computer science Computational complexity theory Mathematics
265	How to Put Through Your Agenda in Collective Binary Decisions? Noga Alon1 , Robert Bredereck2 , Jiehua Chen2 , Stefan Kratsch2 Rolf Niedermeier2 , and Gerhard J. Woeginger3 2 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-10-23 10:13:29 Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity Mathematical optimization Vertex cover Dominating set Time complexity FO Theoretical computer science Computational complexity theory Applied mathematics
266	Journal of Artificial Intelligence Research446 Submitted 12/13; published 6/14 A Multivariate Complexity Analysis of Lobbying in Multiple Referenda Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-06-16 17:55:22 Complexity classes NP-complete problems Analysis of algorithms Mathematical optimization Parameterized complexity NP-hard Kernelization NP P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
267	Approximation Algorithms Recap Advanced Algorithms – COMS31900 A polynomial time algorithm A is an α-approximation for problem P if, it always outputs a solution s with Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes NP-complete problems Bin packing problem Approximation algorithms Discrete geometry Packing problem Polynomial-time approximation scheme Time complexity Bin Theoretical computer science Computational complexity theory Applied mathematics
268	String Range Matching Juha K¨arkk¨ainen Dominik Kempa Simon J. Puglisi Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2014-06-17 03:15:02 Complexity classes Combinatorial optimization Matching Algorithm String searching algorithm String FO 3-dimensional matching Theoretical computer science Mathematics Applied mathematics
269	Approximation Algorithms Recap Advanced Algorithms – COMS31900 An algorithm A is an α-approximation for problem P if, Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Bin packing problem Approximation algorithm Polynomial-time approximation scheme Subset sum problem NP PP Time complexity P Theoretical computer science Computational complexity theory Applied mathematics
270	On Average Sequence Complexity Svante Janson Uppsala University, Sweden Stefano Lonardi University of California, Riverside, CA Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2004-07-29 13:27:00 FO Complexity classes Circuit complexity NC

UPDATE